Fast Marching and Fast Driving: Combining Off-Line Search and Reactive AI
نویسندگان
چکیده
Fast Marching Methods, FMM, have a wide range of applications, including path planning and navigation, but rarely feature in surveys of path planning techniques. For some applications, however, FMM are more suitable than other popular techniques, such as A*. This paper provides a brief outline of how FMM may be applied to path planning problems and notes the strengths and weaknesses of the method. Finally, an example application of the FMM is provided, derived from work that was carried out on a published game.
منابع مشابه
Modified Fast Level Set Method and Fast Marching Method for Medical Images
In this paper, an interactive segmentation method that combines fast marching and fast level set method is proposed. Level set segmentation involves solving the energybased active contour minimization problems by the computation of geodesics or minimal distance curves. First, by selecting the seed point, the fast marching method is used to extract rough boundaries of the interested object. We m...
متن کاملFast Two-scale Methods for Eikonal Equations
Fast Marching and Fast Sweeping are the two most commonly used methods for solving the Eikonal equation. Each of these methods performs best on a different set of problems. Fast Sweeping, for example, will outperform Fast Marching on problems where the characteristics are largely straight lines. Fast Marching, on the other hand, is usually more efficient than Fast Sweeping on problems where cha...
متن کاملLife in the Fast Lane: The Evolution of an Adaptive Vehicle Control System
world has been, and continues to be, one of the most difficult tasks in AI research. Since 1987, researchers at Carnegie Mellon University have been investigating one such task. Their research has been focused on using adaptive, vision-based systems to increase the driving performance of the Navlab line of on-road mobile robots. This research has led to the development of a neural network syste...
متن کاملمسیریابی حرکت روباتهای ماشینواره با روش پیشروی سریع
The Robot Motion Planning (RMP) problem deals with finding a collision-free start-to-goal path for a robot navigating among workspace obstacles. Such a problem is also encountered in path planning of intelligent vehicles and Automatic Guided Vehicles (AGVs). In terms of kinematic constraints, the RMP problem can be categorized into two groups of Holonomic and Nonholonomic problems. In the first...
متن کاملVery Fast Load Flow Calculation Using Fast-Decoupled Reactive Power Compensation Method for Radial Active Distribution Networks in Smart Grid Environment Based on Zooming Algorithm
Distribution load flow (DLF) calculation is one of the most important tools in distribution networks. DLF tools must be able to perform fast calculations in real-time studies at the presence of distributed generators (DGs) in a smart grid environment even in conditions of change in the network topology. In this paper, a new method for DLF in radial active distribution networks is proposed. The ...
متن کامل